Edge Deletion Games with Parity Rules

نویسندگان

Peter Harding

Paul Ottaway

چکیده

We analyze three combinatorial games played on simple undirected graphs. A move consists of deleting a single edge; which edges can be deleted depends on the parity of each edge’s endpoints. While determining the possible values of each game, we show relationships between these games and graph matchings, octal games, vertex deletion games, and graph colourings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vertex Deletion games with Parity rules

We consider a group of related combinatorial games all of which are played on an undirected graph. A move is to remove a vertex but which vertices are available depend on parity conditions. In the main game Left removes a vertex of even degree and Right removes a vertex of odd degree. This game is special case of Odd-Even games introduced, for the first time, in this paper. The obvious two vari...

متن کامل

The Complexity of All-switches Strategy Improvement

Strategy improvement is a widely-used and well-studied class of algorithms for solving graph-based infinite games. These algorithms are parametrized by a switching rule, and one of the most natural rules is “all switches” which switches as many edges as possible in each iteration. Continuing a recent line of work, we study all-switches strategy improvement from the perspective of computational ...

متن کامل

Edge Detection Based On Nearest Neighbor Linear Cellular Automata Rules and Fuzzy Rule Based System

Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...

متن کامل

On the positional determinacy of edge-labeled games

It is well known that games with the parity winning condition admit positional determinacy : the winner has always a positional (memoryless) strategy. This property continues to hold if edges rather than vertices are labeled. We show that in this latter case the converse is also true. That is, a winning condition over arbitrary set of colors admits positional determinacy in all games if and onl...

متن کامل